A Hardware/software Approach to Accelerate Boolean Satisfiability
نویسندگان
چکیده
This paper proposes a new algorithm for solving the Boolean satisfiability (SAT) problem. On the basis of this algorithm a software/reconfigurable hardware SAT solver was designed, implemented and compared to a similar realization of the Davis-Putnam-like method. The satisfier suggested uses an application-specific approach, thus an instancespecific hardware compilation is completely avoided.
منابع مشابه
Implementation of the Advanced SAT Search Techniques in Reconfigurable Hardware
This paper presents an application-specific approach to solving the Boolean satisfiability (SAT) problem with the aid of reconfigurable hardware. In the proposed architecture an instance-specific hardware compilation is completely avoided, requiring for each problem instance just the formula information to be downloaded to an FPGA. The previously suggested method of software/reconfigurable hard...
متن کاملUsing Recon gurable Computing Techniques to Accelerate Problems in the CAD Domain: A Case Study with Boolean Satis ability
The Boolean satis ability problem lies at the core of several CAD applications, including automatic test pattern generation and logic synthesis. This paper describes and evaluates an approach for accelerating Boolean satis ability using congurable hardware. Our approach harnesses the increasing speed and capacity of eld-programmable gate arrays by tailoring the SAT-solver circuit to the particu...
متن کاملHardware Acceleration of EDA Algorithms
except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified ...
متن کاملTowards Lightweight Satisfiability Solvers for Self-Verification (Invited Paper)
Solvers for Boolean satisfiability (SAT solvers) are essential for various hardware and software verification tasks such as equivalence checking, property checking, coverage analysis, etc. Nevertheless, despite the fact that very powerful solvers have been developed in the recent decades, this progress often still cannot cope with the exponentially increasing complexity of those verification ta...
متن کاملA Hardware Relaxation Paradigm for Solving NP-Hard Problems
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents a solution to the problem instance. This approach differs from using hardware accelerators to speed up the execution of deterministic algorithms, as it exploits stabilisation properties of circuits with feedback, and ...
متن کامل